An Uncertainty Principle for Functions Defined on Graphs

نویسندگان

  • Ameya Agaskar
  • Yue M. Lu
چکیده

The classical uncertainty principle provides a fundamental tradeoff in the localization of a function in the time and frequency domains. In this paper we extend this classical result to functions defined on graphs. We justify the use of the graph Laplacian’s eigenbasis as a surrogate for the Fourier basis for graphs, and define the notions of “spread” in the graph and spectral domains. We then establish an analogous uncertainty principle relating the two quantities, showing the degree to which a function can be simultaneously localized in the graph and spectral domains.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

THE UNCERTAINTY PRINCIPLE ON CAYLEY GRAPHSElinor

Heisenberg's uncertainty principle is extended to certain nite graphs. The fundamental theorem of calculus, integration by parts, and vanishing boundary terms for graphs are deened as well as functions of random variables, expectation values, and moments on graphs. Section 3 gives three versions of Heisenberg's uncertainty principle for graphs. For the 2nd version, we assume that our graph is t...

متن کامل

Fractal Dimension of Graphs of Typical Continuous Functions on Manifolds

If M is a compact Riemannian manifold then we show that for typical continuous function defined on M, the upper box dimension of  graph(f) is as big as possible and the lower box dimension of graph(f) is as small as possible.  

متن کامل

On the eigenvalues of Cayley graphs on generalized dihedral groups

‎Let $Gamma$ be a graph with adjacency eigenvalues $lambda_1leqlambda_2leqldotsleqlambda_n$‎. ‎Then the energy of‎ ‎$Gamma$‎, ‎a concept defined in 1978 by Gutman‎, ‎is defined as $mathcal{E}(G)=sum_{i=1}^n|lambda_i|$‎. ‎Also‎ ‎the Estrada index of $Gamma$‎, ‎which is defined in 2000 by Ernesto Estrada‎, ‎is defined as $EE(Gamma)=sum_{i=1}^ne^{lambda_i}$‎. ‎In this paper‎, ‎we compute the eigen...

متن کامل

Double Roman domination and domatic numbers of graphs

A double Roman dominating function on a graph $G$ with vertex set $V(G)$ is defined in cite{bhh} as a function$f:V(G)rightarrow{0,1,2,3}$ having the property that if $f(v)=0$, then the vertex $v$ must have at least twoneighbors assigned 2 under $f$ or one neighbor $w$ with $f(w)=3$, and if $f(v)=1$, then the vertex $v$ must haveat least one neighbor $u$ with $f(u)ge 2$. The weight of a double R...

متن کامل

Canonical thermostatics of ideal gas in the frame work of generalized uncertainty principle

The statistical consequences of minimal length supposition are investigated for a canonical ensemble of ideal gas. These effects are encoded in the so-called Generalized Uncertainty Principle (GUP) of the second order. In the frame work of the considered GUP scenario, a unique partition function is obtained by using of two different methods of quantum and classical approaches. It should be noti...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011